On dynamic switching in one-dimensional iterative logic networks

On Dynamic Switching in One-Dimensional Iterative Logic Networks

On the One-Dimensional Optimal Switching Problem

We characterize the optimal switching problem as coupled optimal stoping problems. We then use the optimal stopping theory to provide a solution. As opposed to the methods using quasi-variational inequalities and verification theorem we directly work with the value function.

Reconfigurable logic in nanoelectronic switching networks

We demonstrate how to configure and reconfigure a nanoelectronic nonlinear network to a universal set of logic gates by applying sequences of voltage pulses to the edges of the network. The nanoelectronic device is designed to consist of a self-assembled network of nanoparticles connected by two-terminal linker elements with hysteretic behaviour, allowing voltage-controlled switching between a ...

One-Dimensional Logic over Trees

A one-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. This fragment contains two-variable logic, and it is known that over words both formalisms have the same complexity and expressive power. Here we investigate the one-dimensional fragment over trees. We consider unranked unordered tr...

One-Dimensional Logic over Words

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential quantifiers that leave at most one variable free. We investigate one-dimensional fragment over words and over ω-words. We show that it is expressively equivalent to the twovariable fragment of first-order logic. We also show that its satisfiability problem is NExpTimecomplete. Furthe...